关系模式关键字的一个求解算法

本文给出了关系数据库模式中求解关键字的一个算法。算法很简洁并且对于[1]定义的一大类问题,执行时间是多项式级的。     

FRANCIS QL ALGORITHM FOR FINDING THE EIGENVALUES OF ANTI-SYMMETRIC MATRICES

In this paper,we demonstrate that the double-shift QL algorithm for an irreducible anti-symmetric iridiagonal matrix with the shifts being two eigenvalues of the 2×2 matrix in the left upper corner of this matrix is convergent and the convergence rale of Ms kind of algorithm is generally cubic.     

一类非线性单调型方程的区域分裂法

本文考虑了一类非线性单调问题的加性Schwgrz交替法和异步平行算法,并得到了在能量模意义下的收敛性结果,最后还讨论了格式的有限元离散。     

Parallel globally adaptive quadrature on the KSR-1

New algorithms for parallel one-dimensional globally adaptive quadrature are developed. The algorithms are implemented on a Kendall Square Research KSR-1 parallel computer and numerical results are presented. The most successful algorithm gives significant speedups on a range of hard problems, including ones with singular integrands. Both authors acknowledge the support of the EEC Esprit Basic Research Action Programme, Project 6634 (APPARC). The second author acknowledges the support of the NATO Collaborative Research Grant 920037.     

An approximation result for the interval coloring problem on claw-free chordal graphs

We study the problem of finding an acyclic orientation of an undirected graph, such that each (oriented) path is covered by a limited number k of maximal cliques. This is equivalent to finding a k-approximate solution for the interval coloring problem on a graph. We focus our attention on claw-free chordal graphs, and show how to find an orientation of such a graph in linear time, which guarantees that each path is covered by at most two maximal cliques. This extends previous published results on other graph classes where stronger assumptions were made.     

P‖Cmin随机算法研究

本文研究了P‖Cmin的随机算法及其最坏情况界，我们给出了Pm‖Cmin在线排序问题新的随机上界，并给出了P2‖Cmin的最好随机算法，其最坏情况界为2／3。对P2‖Cmin已知工件加工时间递减半在线模型，我们给出了一最坏情况界为6／7的随机算法并证明了它为最好的。     

中心—焦点区分问题的I l'yashenko算法

对二维平面系统的二维系统的中心焦点区分问题 ,I l'yashenko曾建议一个算法 ,本文给出此法的详细证明 .据此 ,我们讨论了区分问题在 Arnold意义下的代数可解性与不可解性     

约束装箱问题的混合遗传算法求解

本将最佳适应法和遗传算法相结合，提出了一种新的启发式混合遗传算法对具有时间约束的装箱问题进行求解，给出了具体的算法步骤，试算结果表明基于启发式算法的混合遗传算法适合于求解各种约束条件下的大规模装箱问题。     

A New Algorithm for Solving the Word Problem in Braid Groups

One of the most interesting questions about a group is whether its word problem can be solved and how. The word problem in the braid group is of particular interest to topologists, algebraists, and geometers, and is the target of intensive current research. We look at the braid group from a topological point of view (rather than a geometric one). The braid group is defined by the action of diffeomorphisms on the fundamental group of a punctured disk. We exploit the topological definition in order to give a new approach for solving its word problem. Our algorithm, although not better in complexity, is faster in comparison with known algorithms for short braid words, and it is almost independent of the number of strings in the braids. Moreover, the algorithm is based on a new computer presentation of the elements of the fundamental group of a punctured disk. This presentation can be used also for other algorithms.     

A remark on the mallat pyramidal algorithm of wavelet analysis wavelet analysis

The exact relationships between the length of scale sequences and wavelet sequences in the Mallat pyramidal algorithm for computing wavelet transform coefficients are obtained, and the maximum possible scale of arbitrary discrete signal is derived.